A linear lower bound on index size for text retrieval
نویسندگان
چکیده
منابع مشابه
Linear Lower Bound on Degrees
It is established a linear (thereby, sharp) lower bound on degrees of Positivstellensatz calculus refutations over a real eld introduced in GV99], for the Tseitin tautologies and for the parity (the mod 2 principle). We use the machinery of the Laurent proofs developped for binomial systems in BuGI 98], BuGI 99].
متن کاملA Lower Bound for Linear Approximate Compaction
The A-approximate compaction problem is: given an input array of n values, each either 0 or 1, place each value in an output array so that all the l' s are in the first (1 + A) k array locations, where k is the number of 1 's in the input. A is an accuracy parameter. This problem is of fundamental importance in parallel computation because ofits applications to processor allocation and approzim...
متن کاملCube Index: A Text Index Model for Retrieval and Mining
Text retrieval, Analysis, Mining and Knowledge management have gained a lot of importance in a time when we drown in information but are starved for knowledge. In this paper, we propose a novel Index that uses a Text Cube model to store the text information similar to a data cube in Data Mining. This model creates a direct index, next word index and inverted index in a single Cube Index which i...
متن کاملA Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
We study the communication complexity of single-server Private Information Retrieval (PIR) protocols that are based on fundamental cryptographic primitives in a black-box manner. In this setting, we establish a tight lower bound on the number of bits communicated by the server in any polynomially-preserving construction that relies on trapdoor permutations. More specifically, our main result st...
متن کاملTight Lower Bound on Linear Authenticated Encryption
We show that any scheme to encrypt m blocks of size n bits while assuring message integrity, that apart from using m + k invocations of random functions (from n bits to n bits) and vn bits of randomness, is linear in (GF 2) n , must have k + v at least (log m). This lower bound is proved in a very general model which rules out many promising linear modes of operations for encryption with messag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2003
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(03)00043-9